Graph Homomorphisms and Qualitative Software System Analysis

نویسنده

  • C. V. KARAPOULIOS
چکیده

In this paper we present a mathematical model based on graph homomorphisms permitting the analysis and the behavioral envisioning of software based systems. We first try to explain why a qualitative approach is needed and which are the limitations and problems of quantitative analysis techniques. Follow some results of a qualitative abstraction tool and some simple application examples on telecommunication protocol software. We then introduce the concept of a system qualitative graph and the role of graph homomorphisms for modeling a software as a continuous phase transition map operating on an abstract data space. In our presentation this model has been successfully applied to software based systems but it can be generalized to any hybrid system. We finish with the presentation of the underlying mathematical framework and some properties of graph homomorphism invariants. Key-Words: software engineering, qualitative reasoning, software testing, dynamic system analysis, graph homomorphisms, software phase spaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Qualitative Reasoning for Software Systems with Graph Homomorphisms

In this paper we present an ontology for the analysis and the envisioning of software based systems. We first try to identify and solve the main difficulties of using qualitative reasoning in software engineering. Follow some results of a qualitative abstraction tool and some simple application examples. We then introduce the concept of a system qualitative graph, and the role of graph homomorp...

متن کامل

Extremal graphs for homomorphisms

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed image graph H. We introduce our techniques by proving that the lex graph has the largest number of ho...

متن کامل

Graph homomorphisms: structure and symmetry

This paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. We give the basic definitions, examples and uses of graph homomorphisms and mention some results that consider the structure and some parameters of the graphs involved. We discuss vertex transitive graphs and Cayley graphs and their rather fundamental role in some asp...

متن کامل

Counting Graph Homomorphisms

3 Connection matrices 9 3.1 The connection matrix of a graph parameter . . . . . . . . . . . . . . . . . . . . 9 3.2 The rank of connection matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3 Connection matrices of homomorphisms . . . . . . . . . . . . . . . . . . . . . . . 12 3.4 The exact rank of connection matrices for homomorphisms . . . . . . . . . . . . 13 3.5 Extensions...

متن کامل

Graph homomorphisms III: Models

Following the last talk on graph homomorphisms, we continue to discuss some examples of graph homomorphisms. But this time we will focus on some models, that is, the homomorphism G → H for the graph H with fixed weights. The main reference is Section 1 in [2].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005